Embedding Four-directional Paths on Convex Point Sets

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Embedding Four-Directional Paths on Convex Point Sets

A directed path whose edges are assigned labels “up”, “down”, “right”, or “left” is called four-directional, and three-directional if at most three out of the four labels are used. A direction-consistent embedding of an n-vertex threeor four-directional path P on a set S of n points in the plane is a straight-line drawing of P where each vertex of P is mapped to a distinct point of S and every ...

متن کامل

On k-convex point sets

We extend the (recently introduced) notion of k-convexity of a two-dimensional subset of the Euclidean plane to finite point sets. A set of n points is ∗Corresponding author. Email addresses: [email protected] (Oswin Aichholzer), [email protected] (Franz Aurenhammer), [email protected] (Thomas Hackl), [email protected] (Ferran Hurtado), [email protected] (Alexander Pilz), pedro.ramos@uah...

متن کامل

Geometric graphs on convex point sets

In this note, we introduce a family of bipartite graphs called path restricted ordered bipartite graphs and present it as an abstract generalization of some well known geometric graphs like unit distance graphs on convex point sets. In the framework of convex point sets, we also focus on a generalized version of Gabriel graphs known as locally Gabriel graphs or LGGs. LGGs can also be seen as th...

متن کامل

An embedding theorem for convex fuzzy sets

In this paper we embed the space of upper semicontinuous convex fuzzy sets on a Banach space into a space of continuous functions on a compact space. The following structures are preserved by the embedding: convex cone, metric, sup-semilattice. The indicator function of the unit ball is mapped to the constant function 1. Two applications are presented: strong laws of large numbers for fuzzy ran...

متن کامل

Empty non-convex and convex four-gons in random point sets

Let S be a set of n points distributed uniformly and independently in a convex, bounded set in the plane. A four-gon is called empty if it contains no points of S in its interior. We show that the expected number of empty non-convex four-gons with vertices from S is 12n logn + o(n logn) and the expected number of empty convex four-gons with vertices from S is Θ(n). keywords: random point set, e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Graph Algorithms and Applications

سال: 2015

ISSN: 1526-1719

DOI: 10.7155/jgaa.00368